On the Characteristic Polynomial of n-Cayley Digraphs

نویسندگان

  • Majid Arezoomand
  • Bijan Taeri
چکیده

A digraph Γ is called n-Cayley digraph over a group G, if there exists a semiregular subgroup RG of Aut(Γ) isomorphic to G with n orbits. In this paper, we represent the adjacency matrix of Γ as a diagonal block matrix in terms of irreducible representations of G and determine its characteristic polynomial. As corollaries of this result we find: the spectrum of semi-Cayley graphs over abelian groups, a relation between the characteristic polynomial of an n-Cayley graph and its complement, and the spectrum of Cayley graphs over groups having cyclic subgroups. Finally we determine the eigenspace of n-Cayley digraphs and their main eigenvalues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

Cayley graph associated to a semihypergroup

The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first  we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as  Hamiltonian cycles in this  graph.  Also, by some of examples we will illustrate  the properties and behavior of  these Cayley  graphs, in particulars we show that ...

متن کامل

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

The diameter of random Cayley digraphs of given degree

We consider random Cayley digraphs of order n with uniformly distributed generating set of size k. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as n →∞ and k = f(n). We find a sharp phase transition from 0 to 1 as the order of growth of f(n) increases past √ n log n. In particular, if f(n) is asymptotically linear in n, the probabi...

متن کامل

The Cayley-Hamilton theorem

Theorem 1. Let A be a n × n matrix, and let p(λ) = det(λI − A) be the characteristic polynomial of A. Then p(A) = 0.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2013